Permutation invariant lattices
نویسندگان
چکیده
We say that a Euclidean lattice in Rn is permutation invariant if its automorphism group has non-trivial intersection with the symmetric group Sn, i.e., if the lattice is closed under the action of some non-identity elements of Sn. Given a fixed element τ ∈ Sn, we study properties of the set of all lattices closed under the action of τ : we call such lattices τ -invariant. These lattices naturally generalize cyclic lattices introduced by Micciancio in [8, 9], which we previously studied in [1]. Continuing our investigation, we discuss some basic properties of permutation invariant lattices, in particular proving that the subset of well-rounded lattices in the set of all τ -invariant lattices in Rn has positive co-dimension (and hence comprises zero proportion) for all τ different from an n-cycle.
منابع مشابه
Semimodular Lattices and Semibuildings
In a ranked lattice, we consider two maximal chains, or “flags” to be i-adjacent if they are equal except possibly on rank i . Thus, a finite rank lattice is a chamber system. If the lattice is semimodular, as noted in [9], there is a “Jordan-Hölder permutation” between any two flags. This permutation has the properties of an Sn-distance function on the chamber system of flags. Using these noti...
متن کاملMinimal Paths between Maximal Chains in Finite Rank Semimodular Lattices
We study paths between maximal chains, or “flags,” in finite rank semimodular lattices. Two flags are adjacent if they differ on at most one rank. A path is a sequence of flags in which consecutive flags are adjacent. We study the union of all flags on at least one minimum length path connecting two flags in the lattice. This is a subposet of the original lattice. If the lattice is modular, the...
متن کاملEffective Invariant Theory of Permutation Groups Using Representation Theory
Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner combinatorial description of the invariant ring. Computational Invariant Theory, representation theory, permutation group This is a drafty old version : full ...
متن کاملNon-permutation Invariant Borel Quantifiers
Every permutation invariant Borel subset of the space of countable structures is definable in Lω1ω by a theorem of Lopez-Escobar. We prove variants of this theorem relative to fixed relations and fixed non-permutation invariant quantifiers. Moreover we show that for every closed subgroup G of the symmetric group S∞, there is a closed binary quantifier Q such that the G-invariant subsets of the ...
متن کاملOn lower bounds for integration of multivariate permutation-invariant functions
In this note we study multivariate integration for permutation-invariant functions from a certain Banach space Ed,α of Korobov type in the worst case setting. We present a lower error bound which particularly implies that in dimension d every cubature rule which reduces the initial error necessarily uses at least d+ 1 function values. Since this holds independently of the number of permutation-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 338 شماره
صفحات -
تاریخ انتشار 2015